Investigation of Subalgebra Lattices by Means of Hasse Constants

نویسندگان

  • Petr Vojtěchovský
  • PETR VOJTĚCHOVSKÝ
چکیده

Hasse constants and their basic properties are introduced to facilitate the connection between the lattice of subalgebras of an algebra C and the natural action of the automorphism group Aut(C) on C. These constants are then used to describe the lattice of subloops of the smallest nonassociative simple Moufang loop.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak Congruences of Algebras with Constants

The paper deals with weak congruences of algebras having at least two constants in the similarity type. The presence of constants is a necessary condition for complementedness of the weak congruence lattices of non-trivial algebras. Some sufficient conditions for the same property are also given. In particular, so called 0,1-algebras have complemented weak congruence lattices if and only if the...

متن کامل

FUZZY CONVEX SUBALGEBRAS OF COMMUTATIVE RESIDUATED LATTICES

In this paper, we define the notions of fuzzy congruence relations and fuzzy convex subalgebras on a commutative residuated lattice and we obtain some related results. In particular, we will show that there exists a one to one correspondence between the set of all fuzzy congruence relations and the set of all fuzzy convex subalgebras on a commutative residuated lattice. Then we study fuzzy...

متن کامل

A degree bound for the Graver basis of non-saturated lattices

Let $L$ be a lattice in $ZZ^n$ of dimension $m$. We prove that there exist integer constants $D$ and $M$ which are basis-independent such that the total degree of any Graver element of $L$ is not greater than $m(n-m+1)MD$. The case $M=1$ occurs precisely when $L$ is saturated, and in this case the bound is a reformulation of a well-known bound given by several authors. As a corollary, we show t...

متن کامل

Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices

The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distributive lattice.

متن کامل

QUANTALE-VALUED SUP-ALGEBRAS

Based on the notion of $Q$-sup-lattices (a fuzzy counterpart of complete join-semilattices valuated in a commutative quantale), we present the concept of $Q$-sup-algebras -- $Q$-sup-lattices endowed with a collection of finitary operations compatible with the fuzzy joins. Similarly to the crisp case investigated in cite{zhang-laan}, we characterize their subalgebras and quotients, and following...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007